Propositional Defeasible Logic has Linear Complexity
نویسنده
چکیده
Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts markedly with most other propositional nonmonotonic logics, in which inference is intractable.
منابع مشابه
Propositional Defeasible Logic has Linear Complexity
19 and has undergone a preliminary experimental evaluation [23]. It executes simple, but large, theories of basic defeasible logic very quickly. The linear complexity of the algorithm is supported empirically. However, the transformations used to convert an arbitrary defeasible theory to the appropriate form for the algorithm of Figure 1 impose a large constant factor, particularly on the cost ...
متن کاملPropositional Clausal Defeasible Logic
Defeasible logics are non-monotonic reasoning systems that have efficient implementations and practical applications. We list several desirable properties and note that each defeasible logic fails to have some of these properties. We define and explain a new defeasible logic, called clausal defeasible logic (CDL), which has all these properties. CDL is easy to implement, consistent, detects loo...
متن کاملArgumentation and Propositional Logic
Argumentation has played a significant role in understanding and unifying under a common framework different forms of defeasible reasoning in Artificial Intelligence (AI). Argumentation is also close to the original inception of logic as a framework for formalizing human debate and dialogue. The purpose of this paper is to draw a formal connection between argumentation and classical reasoning, ...
متن کاملArgumentation for Propositional Logic and Nonmonotonic Reasoning
Argumentation has played a significant role in understanding and unifying under a common framework different forms of defeasible reasoning in AI. Argumentation is also close to the original inception of logic as a framework for formalizing human argumentation and debate. In this context, the purpose of this paper is twofold: to draw a formal connection between argumentation and classical reason...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- TPLP
دوره 1 شماره
صفحات -
تاریخ انتشار 2001